Some Periodic Groups Admitting a Finite Regular Automorphism of Even Order
نویسندگان
چکیده
منابع مشابه
Finite Groups Admitting a Fixed-Point-Free Automorphism of Order 4
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملAUTOMORPHISM GROUP OF GROUPS OF ORDER pqr
H"{o}lder in 1893 characterized all groups of order $pqr$ where $p>q>r$ are prime numbers. In this paper, by using new presentations of these groups, we compute their full automorphism group.
متن کاملAutomorphism Groups of Some Affine and Finite Type Artin Groups
We observe that, for fixed n ≥ 3, each of the Artin groups of finite type An, Bn = Cn, and affine type Ãn−1 and C̃n−1 is a central extension of a finite index subgroup of the mapping class group of the (n + 2)-punctured sphere. (The centre is trivial in the affine case and infinite cyclic in the finite type cases). Using results of Ivanov and Korkmaz on abstract commensurators of surface mapping...
متن کاملFinite groups have even more centralizers
For a finite group $G$, let $Cent(G)$ denote the set of centralizers of single elements of $G$. In this note we prove that if $|G|leq frac{3}{2}|Cent(G)|$ and $G$ is 2-nilpotent, then $Gcong S_3, D_{10}$ or $S_3times S_3$. This result gives a partial and positive answer to a conjecture raised by A. R. Ashrafi [On finite groups with a given number of centralizers, Algebra Collo...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra and Logic
سال: 2019
ISSN: 0002-5232,1573-8302
DOI: 10.1007/s10469-019-09521-7